Set Convergences. An Attempt of Classification
نویسندگان
چکیده
منابع مشابه
An attempt to set the framework of Model-Oriented Programming
Nowadays, companies involved in the development of modern software face several difficulties. One of the most important ones is the continuous evolution of software platforms (C++, Java, DotNet, CORBA, EJB, Web services, XML, etc.). One interesting solution to this problem is the Model-Driven Architecture (MDA) approach from the OMG. It suggests that domain-specific knowledges should be encapsu...
متن کاملConsiderations on (pseudo-) Convergences of Sequences of Measurable Functions on Monotone Set Multifunction Space
In this paper, we further a previous study concerning convergences and pseudo-convergences of sequences of measurable functions on monotone set multifunction spaces. Various considerations concerning operations and the uniqueness of the limit with respect to such convergences are given and several asymptotic structural properties of certain set multifunctions are, in this way, characterized. Ma...
متن کاملSpaces not distinguishing convergences
In the present paper we introduce a convergence condition (Σ) and continue the study of “not distinguish” for various kinds of convergence of sequences of real functions on a topological space started in [2] and [3]. We compute cardinal invariants associated with introduced properties of spaces.
متن کاملExamples of Set - to - Set Image Classification
We present a framework for representing a set of images as a point on a Grassmann manifold. A collection of sets of images for a specific class is then associated with a collection of points on this manifold. Relationships between classes as defined by points associated with sets of images may be determined using the projection F-norm, geodesic (or other) distances on the Grassmann manifold. We...
متن کاملOn Clique Convergences of Graphs
Let G be a graph and KG be the set of all cliques of G, then the clique graph of G denoted by K(G) is the graph with vertex set KG and two elements Qi, Qj ∈ KG form an edge if and only if Qi ∩ Qj 6= ∅. Iterated clique graphs are defined by K0(G) = G, and K(G) = K(Kn−1(G)) for n > 0. In this paper we determine the number of cliques in K(G) when G = G1+G2, prove a necessary and sufficient conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1993
ISSN: 0002-9947
DOI: 10.2307/2154552